The Classification of Subfactors with Index at Most 5\frac{1}4
نویسندگان
چکیده
Subfactor standard invariants encode quantum symmetries. The small index subfactor classification program has been a rich source of interesting We give the complete to 5 1 4 5\frac {1}{4} , which includes alttext="3 plus StartRoot 5 EndRoot"> 3 + encoding="application/x-tex">3+\sqrt {5} first composite index.
منابع مشابه
The Classification of Subfactors of Index at Most 5
A subfactor is an inclusion N ⊂ M of von Neumann algebras with trivial centers. The simplest example comes from the fixed points of a group action M ⊂M , and subfactors can be thought of as fixed points of more general group-like algebraic structures. These algebraic structures are closely related to tensor categories and have played important roles in knot theory, quantum groups, statistical m...
متن کاملSubfactors of index exactly 5
We give the classification of subfactor planar algebras at index exactly 5. All the examples arise as standard invariants of subgroup subfactors. Some of the requisite uniqueness results come from work of Izumi in preparation. The non-existence results build upon the classification of subfactor planar algebras with index less than 5, with some additional analysis of special cases.
متن کاملTrees with minimal index and diameter at most four
In this paper we consider the trees with fixed order n and diameter d ≤ 4. Among these trees we identify those trees whose index is minimal. © 2009 Elsevier B.V. All rights reserved.
متن کاملThe chromatic index of multigraphs of order at most 10
The maximum of the maximum degree and the 'odd set quotients' provides a well-known lower bound 4)(G) for the chromatic index of a multigraph G. Plantholt proved that if G is a multigraph of order at most 8, its chromatic index equals qS(G) and that if G is a multigraph of order 10, the chromatic index of G cannot exceed qS(G) + 1. We identify those multigraphs G of order 9 and 10 whose chromat...
متن کاملChromaticity of Turan Graphs with At Most Three Edges Deleted
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Memoirs of the American Mathematical Society
سال: 2023
ISSN: ['1947-6221', '0065-9266']
DOI: https://doi.org/10.1090/memo/1405